The Euler’s Function
نویسندگان
چکیده
This article is concerned with the Euler’s function [10] that plays an important role in cryptograms. In the first section, we present some selected theorems on integers. Next, we define the Euler’s function. Finally, three theorems relating to the Euler’s function are proved. The third theorem concerns two relatively prime integers which make up the Euler’s function parameter. In the public key cryptography these two integer values are used as public and secret keys.
منابع مشابه
Euler’s Constant: Euler’s Work and Modern Developments
This paper has two parts. The first part surveys Euler’s work on the constant γ = 0.57721 · · · bearing his name, together with some of his related work on the gamma function, values of the zeta function, and divergent series. The second part describes various mathematical developments involving Euler’s constant, as well as another constant, the Euler–Gompertz constant. These developments inclu...
متن کاملA q-analog of Euler's decomposition formula for the double zeta function
The double zeta function was first studied by Euler in response to a letter from Goldbach in 1742. One of Euler’s results for this function is a decomposition formula, which expresses the product of two values of the Riemann zeta function as a finite sum of double zeta values involving binomial coefficients. Here, we establish a q-analog of Euler’s decomposition formula. More specifically, we s...
متن کاملSquare Values of Euler’s Function
We show that almost all squares are missing from the range of Euler’s φfunction.
متن کاملA q-analog of Euler’s reduction formula for the double zeta function
The double zeta function is a function of two arguments defined by a double Dirichlet series, and was first studied by Euler in response to a letter from Goldbach in 1742. By calculating many examples, Euler inferred a closed form evaluation of the double zeta function in terms of values of the Riemann zeta function, in the case when the two arguments are positive integers with opposite parity....
متن کاملEuler’s Theorem and Small Fermat’s Theorem
This article is concerned with Euler’s theorem and small Fermat’s theorem that play important roles in public-key cryptograms. In the first section, we present some selected theorems on integers. In the following section, we remake definitions about the finite sequence of natural, the function of natural times finite sequence of natural and π of the finite sequence of natural. We also prove som...
متن کامل